package lanqiao;
/**
 * @Project : AlgorithmLearning
 * @Package : LanQiao.PrepareForCompetition
 * @File : Q0120.java
 * @Author : WangRuoyu
 * @Date : 2023/3/23 10:06
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import java.util.Arrays;

public class Q0120 {

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static long gcd_sub(long a, long b) {
        if (b > a) {
            long t = a;
            a = b;
            b = t;
        }
        if (b == 1) return a;
        return gcd_sub(b, a / b);
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] words = br.readLine().split(" ");

        int n = Integer.parseInt(words[0]);
        long[] nums = new long[n];
        long[] a = new long[n];
        long[] b = new long[n];

        words = br.readLine().split(" ");

        for (int i = 0; i < n; ++i) {
            nums[i] = Long.parseLong(words[i]);
        }

        Arrays.sort(nums);
        int cnt = 0;

        for (int i = 1; i < n; ++i) {
            if (nums[i] != nums[i - 1]) {
                long d = gcd(nums[i], nums[0]);
                a[cnt] = nums[i] / d;
                b[cnt] = nums[0] / d;
                cnt++;
            }
        }

        long up = a[0];
        long down = b[0];

        for (int i = 0; i < cnt; ++i) {
            up = gcd_sub(up, a[i]);
            down = gcd_sub(down, b[i]);
        }

        System.out.printf("%d/%d", up, down);

    }
}
